package cn.crce.cloud9.comp;

/**
 * @author OnCloud9
 * @description
 * @project NRCE-TEST
 * @date 2022年09月13日 下午 09:32
 */
public class Case36 {
    public static void main(String[] args) {
        int bound = 100;
        int i = 0, j = 0, counter = 0, k = 0;
        int temp = 0;
        boolean first = true;
        for (i = 1; i < bound; i++) {
            for (j = 1; j < bound; j++) {
                //*********Found**********
                temp = i * i + 5 * j * j;
                k = (int) Math.sqrt(temp);
                //*********Found**********
                if (k < bound && k*k==temp) {
                    if (first) {
                        System.out.println("The first component: (" + i + ", " + j + ", " + k + ")");
                        //*********Found**********
                        first = false;
                    }
                    //*********Found**********
                    counter ++ ;
                }
            }
            ;
        }
        System.out.print("Total number is: " + counter);
        System.exit(0);
    }
}
